A Combinatorial Proof for the Alternating Convolution of the Central Binomial Coefficients

نویسنده

  • Michael Z. Spivey
چکیده

We give a combinatorial proof of the identity for the alternating convolution of the central binomial coefficients. Our proof entails applying an involution to certain colored permutations and showing that only permutations containing cycles of even length remain. The combinatorial identity

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unimodality via Alternating Gamma Vectors

For a polynomial with palindromic coefficients, unimodality is equivalent to having a nonnegative g-vector. A sufficient condition for unimodality is having a nonnegative γ-vector, though one can have negative entries in the γ-vector and still have a nonnegative g-vector. In this paper we provide combinatorial models for three families of γ-vectors that alternate in sign. In each case, the γ-ve...

متن کامل

Catalan Triangle Numbers and Binomial Coefficients

The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac–Moody algebras. We prove that any binomial coefficient can be written as weighted sums along rows of the Catalan triangle. The coefficients in the sums form a triangular array, which we call the alternating Jacobsthal triangle. We study various subs...

متن کامل

An Alternate Approach to Alternating Sums: A Method to DIE for

would you be inclined to try to prove these by counting arguments? Probably not. We confess that there was a time that when we saw alternating sum identities like the ones above, we would attack it with noncombinatorial proof techniques, like induction or generating functions. After all, how can an object be added a negative number of times? Perhaps it can be tackled using the Principle of Incl...

متن کامل

Some Convolution Identities and an Inverse Relation Involving Partial Bell Polynomials

We prove an inverse relation and a family of convolution formulas involving partial Bell polynomials. Known and some presumably new combinatorial identities of convolution type are discussed. Our approach relies on an interesting multinomial formula for the binomial coefficients. The inverse relation is deduced from a parametrization of suitable identities that facilitate dealing with nested co...

متن کامل

A Famous Identity of Hajós in Terms of Sets

By considering the famous identity on the convolution of the central binomial coefficients

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • The American Mathematical Monthly

دوره 121  شماره 

صفحات  -

تاریخ انتشار 2014